Preliminaries to Circuits , I
نویسندگان
چکیده
1This work was initiated while the second author visited Nagano (March–May 1994) and then continued when the third author visited Edmonton (May–June 1994). The work was finalized when the fourth author visited Białystok (October–November 1994). Partial funding for this work has been provided by: Shinshu Endowment Fund for Information Science, NSERC Grant OGP9207, JSTF award 651-93-S009. 1 The proposition (1) has been removed.
منابع مشابه
New methods for constructing shellable simplicial complexes
A clutter $mathcal{C}$ with vertex set $[n]$ is an antichain of subsets of $[n]$, called circuits, covering all vertices. The clutter is $d$-uniform if all of its circuits have the same cardinality $d$. If $mathbb{K}$ is a field, then there is a one-to-one correspondence between clutters on $V$ and square-free monomial ideals in $mathbb{K}[x_1,ldots,x_n]$ as follows: To each clutter $mathcal{C}...
متن کاملLaplacian Energy of a Fuzzy Graph
A concept related to the spectrum of a graph is that of energy. The energy E(G) of a graph G is equal to the sum of the absolute values of the eigenvalues of the adjacency matrix of G . The Laplacian energy of a graph G is equal to the sum of distances of the Laplacian eigenvalues of G and the average degree d(G) of G. In this paper we introduce the concept of Laplacian energy of fuzzy graphs. ...
متن کاملModeling of Syllogisms in Analog Hardware
Syllogistic reasoning is modeled in analog hardware and some hardware models, i.e. syllogisms Baroco and Darii are presented. Chaining of syllogisms is modeled by using original min-max entities (circuits), “to see” whether the two rules, modeled in dedicated hardware, i.e., IF A THEN B and IF B THEN C imply the “hardware” rule IF A THEN C. The preliminaries include original min-max circuits ba...
متن کاملOn Computation and Random Strings
2 Preliminaries 2 2.1 Strings and Languages . . . . . . . . . . . . . . . . . . . . . . . . 2 2.2 Turing Machines . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 2.3 Recognizers and Deciders . . . . . . . . . . . . . . . . . . . . . . 4 2.4 Alternation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4 2.5 Complexity Classes . . . . . . . . . . . . . . . . . . . . . . . . . ....
متن کاملPreliminaries to Circuits, I 1
This article is the rst in a series of four articles (continued in 24, 23, 25]) about modelling circuits by many-sorted algebras. Here, we introduce some auxiliary notations and prove auxiliary facts about many sorted sets, many sorted functions and trees. One can prove the following proposition (1) For all sets X, Y holds X n Y misses Y. The scheme FraenkelFinIm concerns a nite non empty set A...
متن کامل